Supervised ML Algorithms in the High Dimensional Applications for Dimension Reduction

نویسندگان

چکیده

We steered comparative analysis of manifold supervised dimension reduction methods by assimilating customary multiobjective standard metrics and validated the efficacy learning algorithms in reliance on data sample complexity. The question intricacy is deliberated dependence automating selection user-purposed instances. Different techniques are responsive to different scales measurement supervision also discussed comprehensively. In line with prospects, each technique diverse competence for datasets there was no mode gauge general ranking trustily available. especially engrossed classifier concocted a system erected weighted average rank called mean risk adjusted model (WMRRAM) consensus algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dimension reduction for high-dimensional data.

With advancing of modern technologies, high-dimensional data have prevailed in computational biology. The number of variables p is very large, and in many applications, p is larger than the number of observational units n. Such high dimensionality and the unconventional small-n-large-p setting have posed new challenges to statistical analysis methods. Dimension reduction, which aims to reduce t...

متن کامل

Supervised dimension reduction mappings

Abstract. We propose a general principle to extend dimension reduction tools to explicit dimension reduction mappings and we show that this can serve as an interface to incorporate prior knowledge in the form of class labels. We explicitly demonstrate this technique by combining locally linear mappings which result from matrix learning vector quantization schemes with the t-distributed stochast...

متن کامل

A Projection Pursuit framework for supervised dimension reduction of high dimensional small sample datasets

The analysis and interpretation of datasets with large number of features and few examples has remained as a challenging problem in the scientific community, owing to the difficulties associated with the curse-of-the-dimensionality phenomenon. Projection Pursuit (PP) has shown promise in circumventing this phenomenon by searching low-dimensional projections of the data where meaningful structur...

متن کامل

Signed Laplacian Embedding for Supervised Dimension Reduction

Manifold learning is a powerful tool for solving nonlinear dimension reduction problems. By assuming that the high-dimensional data usually lie on a low-dimensional manifold, many algorithms have been proposed. However, most algorithms simply adopt the traditional graph Laplacian to encode the data locality, so the discriminative ability is limited and the embedding results are not always suita...

متن کامل

Two models for Bayesian supervised dimension reduction

We study and develop two Bayesian frameworks for supervised dimension reduction that apply to nonlinear manifolds: Bayesian mixtures of inverse regressions and gradient based methods. Formal probabilistic models with likelihoods and priors are given for both methods and efficient posterior estimates of the effective dimension reduction space and predictive factors can be obtained by a Gibbs sam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2022

ISSN: ['1026-7077', '1563-5147', '1024-123X']

DOI: https://doi.org/10.1155/2022/5816145